On Conjugacy of Languages
نویسندگان
چکیده
We say that two languages X and Y are conjugates if they satisfy the conjugacy equation XZ = ZY for some language Z. We study several problems associated to this equation. For example, we characterize all sets which are conjugated via a two-element biprefix set Z, as well as all two-element sets which are conjugates. Mathematics Subject Classification. 68R15, 68Q70.
منابع مشابه
Conjugacy growth series and languages in groups
In this paper we introduce the geodesic conjugacy language and geodesic conjugacy growth series for a finitely generated group. We study the effects of various group constructions on rationality of both the geodesic conjugacy growth series and spherical conjugacy growth series, as well as on regularity of the geodesic conjugacy language and spherical conjugacy language. In particular, we show t...
متن کاملGroups with Context-Free Conjugacy Problems
The conjugacy problem and the inverse conjugacy problem of a finitely generated group are defined, from a language theoretic point of view, as sets of pairs of words. An automaton might be obliged to read the two input words synchronously, or could have the option to read asynchronously. Hence each class of languages gives rise to four classes of groups; groups whose (inverse) conjugacy problem...
متن کاملOn the Regular Power Graph on the Conjugacy Classes of Finite Groups
emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.
متن کاملOn the type of conjugacy classes and the set of indices of maximal subgroups
Let $G$ be a finite group. By $MT(G)=(m_1,cdots,m_k)$ we denote the type of conjugacy classes of maximal subgroups of $G$, which implies that $G$ has exactly $k$ conjugacy classes of maximal subgroups and $m_1,ldots,m_k$ are the numbers of conjugates of maximal subgroups of $G$, where $m_1leqcdotsleq m_k$. In this paper, we give some new characterizations of finite groups by ...
متن کاملConjugacy Languages in Groups
We study the regularity of several languages derived from conjugacy classes in a finitely generated group G for a variety of examples including word hyperbolic, virtually abelian, Artin, and Garside groups. We also determine the rationality of the growth series of the shortlex conjugacy language in virtually cyclic groups, proving one direction of a conjecture of Rivin. 2010 Mathematics Subject...
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 35 شماره
صفحات -
تاریخ انتشار 2001